game with equilibrium pairs

См. также в других словарях:

• Core (game theory) — The core is the set of feasible allocations that cannot be improved upon by a subset (a coalition) of the economy s consumers. A coalition is said to improve upon or block a feasible allocation if the members of that coalition are better off… …   Wikipedia

• Mafia (party game) — Designer(s) Dimitry Davidoff Players 4 or more1 Age range 12 and up Skill(s) required Strategic thought Team play Social skills Roleplay 1See Basic gameplay below …   Wikipedia

• Nobel Prizes — ▪ 2009 Introduction Prize for Peace       The 2008 Nobel Prize for Peace was awarded to Martti Ahtisaari, former president (1994–2000) of Finland, for his work over more than 30 years in settling international disputes, many involving ethnic,… …   Universalium

• Prisoner's dilemma — This article is about game theory. For the 1988 novel, see Prisoner s Dilemma (novel). For the Doctor Who audiobook, see The Prisoner s Dilemma. For the 2001 play, see The Prisoner s Dilemma (play). The prisoner’s dilemma is a canonical example… …   Wikipedia

• Rock-paper-scissors — Roshambo redirects here. For the phonetically similar name and terms derived from it, see Rochambeau (disambiguation). For the bullying practice, see sack tapping. Rock paper scissors Rock paper scissors chart Years active Chinese Han Dynasty to… …   Wikipedia

• Risk dominance — Infobox equilibrium name = Risk dominance Payoff dominance subsetof = Nash equilibrium supersetof = discoverer = John Harsanyi, Reinhard Selten usedfor = Non cooperative games example = Stag huntRisk dominance and payoff dominance are two related …   Wikipedia

• Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

• Core (economics) — The core is the set of feasible allocations that cannot be improved upon by a subset (a coalition ) of the economy s consumers. A coalition is said to improve upon or block a feasible allocation if the members of that coalition are better off… …   Wikipedia

• List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

• Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… …   Wikipedia

• Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… …   Wikipedia